#include <stdio.h>

int count = 0;

int Fib(int n)
{
    count++;
    if(n <= 2)
    return 1;
    if(n > 2)
    return Fib(n-1) + Fib(n-2);
}

int main()
{
    int n = 0;
    scanf("%d", &n);
    printf("Fn = %d", Fib(n));
    printf(", 递归函数执行次数 = %d", count);
    return 0;
}